TSTP Solution File: PUZ102^5 by cocATP---0.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : PUZ102^5 : TPTP v6.1.0. Bugfixed v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n117.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32286.75MB
% OS       : Linux 2.6.32-431.20.3.el6.x86_64
% CPULimit : 300s
% DateTime : Thu Jul 17 13:28:59 EDT 2014

% Result   : Theorem 0.36s
% Output   : Proof 0.36s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : PUZ102^5 : TPTP v6.1.0. Bugfixed v5.2.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n117.star.cs.uiowa.edu
% % Model    : x86_64 x86_64
% % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory   : 32286.75MB
% % OS       : Linux 2.6.32-431.20.3.el6.x86_64
% % CPULimit : 300
% % DateTime : Thu Jul 17 08:18:46 CDT 2014
% % CPUTime  : 0.36 
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% FOF formula (<kernel.Constant object at 0x19302d8>, <kernel.DependentProduct object at 0x194eb00>) of role type named s_type
% Using role type
% Declaring s:(fofType->fofType)
% FOF formula (<kernel.Constant object at 0x1573488>, <kernel.DependentProduct object at 0x194e7a0>) of role type named cCKB_E2_type
% Using role type
% Declaring cCKB_E2:(fofType->(fofType->Prop))
% FOF formula (((eq (fofType->(fofType->Prop))) cCKB_E2) (fun (Xx:fofType) (Xy:fofType)=> (forall (Xp:(fofType->Prop)), (((and (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))->(Xp Xy))))) of role definition named cCKB_E2_def
% A new definition: (((eq (fofType->(fofType->Prop))) cCKB_E2) (fun (Xx:fofType) (Xy:fofType)=> (forall (Xp:(fofType->Prop)), (((and (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))->(Xp Xy)))))
% Defined: cCKB_E2:=(fun (Xx:fofType) (Xy:fofType)=> (forall (Xp:(fofType->Prop)), (((and (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))->(Xp Xy))))
% FOF formula (forall (Xx:fofType), ((cCKB_E2 Xx) (s (s Xx)))) of role conjecture named cCKB_L33000
% Conjecture to prove = (forall (Xx:fofType), ((cCKB_E2 Xx) (s (s Xx)))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(forall (Xx:fofType), ((cCKB_E2 Xx) (s (s Xx))))']
% Parameter fofType:Type.
% Parameter s:(fofType->fofType).
% Definition cCKB_E2:=(fun (Xx:fofType) (Xy:fofType)=> (forall (Xp:(fofType->Prop)), (((and (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))->(Xp Xy)))):(fofType->(fofType->Prop)).
% Trying to prove (forall (Xx:fofType), ((cCKB_E2 Xx) (s (s Xx))))
% Found x100:=(x10 x0):(Xp (s (s Xx)))
% Found (x10 x0) as proof of (Xp (s (s Xx)))
% Found ((x1 Xx) x0) as proof of (Xp (s (s Xx)))
% Found (fun (x1:(forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))=> ((x1 Xx) x0)) as proof of (Xp (s (s Xx)))
% Found (fun (x0:(Xp Xx)) (x1:(forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))=> ((x1 Xx) x0)) as proof of ((forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))->(Xp (s (s Xx))))
% Found (fun (x0:(Xp Xx)) (x1:(forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))=> ((x1 Xx) x0)) as proof of ((Xp Xx)->((forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))->(Xp (s (s Xx)))))
% Found (and_rect00 (fun (x0:(Xp Xx)) (x1:(forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))=> ((x1 Xx) x0))) as proof of (Xp (s (s Xx)))
% Found ((and_rect0 (Xp (s (s Xx)))) (fun (x0:(Xp Xx)) (x1:(forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))=> ((x1 Xx) x0))) as proof of (Xp (s (s Xx)))
% Found (((fun (P:Type) (x0:((Xp Xx)->((forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))->P)))=> (((((and_rect (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))) P) x0) x)) (Xp (s (s Xx)))) (fun (x0:(Xp Xx)) (x1:(forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))=> ((x1 Xx) x0))) as proof of (Xp (s (s Xx)))
% Found (fun (x:((and (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))))=> (((fun (P:Type) (x0:((Xp Xx)->((forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))->P)))=> (((((and_rect (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))) P) x0) x)) (Xp (s (s Xx)))) (fun (x0:(Xp Xx)) (x1:(forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))=> ((x1 Xx) x0)))) as proof of (Xp (s (s Xx)))
% Found (fun (Xp:(fofType->Prop)) (x:((and (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))))=> (((fun (P:Type) (x0:((Xp Xx)->((forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))->P)))=> (((((and_rect (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))) P) x0) x)) (Xp (s (s Xx)))) (fun (x0:(Xp Xx)) (x1:(forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))=> ((x1 Xx) x0)))) as proof of (((and (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))->(Xp (s (s Xx))))
% Found (fun (Xx:fofType) (Xp:(fofType->Prop)) (x:((and (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))))=> (((fun (P:Type) (x0:((Xp Xx)->((forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))->P)))=> (((((and_rect (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))) P) x0) x)) (Xp (s (s Xx)))) (fun (x0:(Xp Xx)) (x1:(forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))=> ((x1 Xx) x0)))) as proof of ((cCKB_E2 Xx) (s (s Xx)))
% Found (fun (Xx:fofType) (Xp:(fofType->Prop)) (x:((and (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))))=> (((fun (P:Type) (x0:((Xp Xx)->((forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))->P)))=> (((((and_rect (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))) P) x0) x)) (Xp (s (s Xx)))) (fun (x0:(Xp Xx)) (x1:(forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))=> ((x1 Xx) x0)))) as proof of (forall (Xx:fofType), ((cCKB_E2 Xx) (s (s Xx))))
% Got proof (fun (Xx:fofType) (Xp:(fofType->Prop)) (x:((and (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))))=> (((fun (P:Type) (x0:((Xp Xx)->((forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))->P)))=> (((((and_rect (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))) P) x0) x)) (Xp (s (s Xx)))) (fun (x0:(Xp Xx)) (x1:(forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))=> ((x1 Xx) x0))))
% Time elapsed = 0.051284s
% node=12 cost=129.000000 depth=11
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (Xx:fofType) (Xp:(fofType->Prop)) (x:((and (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))))=> (((fun (P:Type) (x0:((Xp Xx)->((forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))->P)))=> (((((and_rect (Xp Xx)) (forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu)))))) P) x0) x)) (Xp (s (s Xx)))) (fun (x0:(Xp Xx)) (x1:(forall (Xu:fofType), ((Xp Xu)->(Xp (s (s Xu))))))=> ((x1 Xx) x0))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------